Cache-Oblivious Planar Shortest Paths
نویسندگان
چکیده
We present an efficient cache-oblivious implementation of the shortest-path algorithm for planar graphs by Klein et al., and prove that it incurs no more than O ` N B1/2− + N B logN ́ block transfers on a graph with N vertices. This is the first cache-oblivious algorithm for this problem that incurs o(N) block transfers.
منابع مشابه
A Cache Oblivious Approach for the Problem of Computing Single Source Shortest Paths on Undirected Graphs
This report presents the current state of my research activity in the framework of my Doctorate program. The main problem I am studying is how to obtain an I/O efficient cache oblivious Single Source Shortest Paths (SSSP) algorithm for undirected graphs. The background of my work is described in Section 1, where we explain why it is important to develop algorithms making an efficient usage of m...
متن کاملAlgorithms to Take Advantage of Hardware Prefetching
Cache-oblivious and cache-aware algorithms have been developed to minimize cache misses. Some of the newest processors have hardware prefetching where cache misses are avoided by predicting ahead of time what memory will be needed in the future and bringing that memory into the cache before it is used. It is shown that hardware prefetching permits the standard Floyd-Warshall algorithm for all-p...
متن کاملCache-Adaptive Algorithms
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to environments in which the amount of memory available to an algorithm can fluctuate. The cache-adaptive model applies to operating systems, databases, and other systems where the allocation of memory to processes changes over time. We prove that if an optimal cache-oblivious algorithm has a particular ...
متن کاملCache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search (BFS) on undirected graphs and the single-source shortest path (SSSP) problem on undirected graphs with non-negative edge weights. For the SSSP problem, our result closes the performance gap between the currently best cache-aware algorithm and the cacheoblivious counterpart. Our cache-oblivious SSSP-algo...
متن کاملI/O-optimal algorithms on grid graphs
Given a graph of which the n vertices form a regular two-dimensional grid, and in which each (possibly weighted and/or directed) edge connects a vertex to one of its eight neighbours, the following can be done in O(scan(n)) I/Os, provided M = Ω(B): computation of shortest paths with non-negative edge weights from a single source, breadth-first traversal, computation of a minimum spanning tree, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005